Поиск по сайту

Information

По вашему запросу найдено материалов: 1
Искать:
Rybalov A. N. «On generic complexity of the graph clustering problem» // Applied Discrete Mathematics 2019. №46 C.72-77
Cheremisinova Liudmila D., Cheremisinov Dmitry I. «Subcircuits discovery in transistor level CMOS circuits using Graph Mining» // Tomsk State University Journal of Control and Computer Science 2019. №48 C.74-82
Rybalov Alexandr N. «The generic complexity of the bounded problem of graphs clustering» // Applied Discrete Mathematics 2022. №57 C.91-97
Rybalov A. N. «On generic complexity of the graph clustering problem with bounded clusters» // Applied Discrete Mathematics 2023. №60 C.114-119